Efficient goal directed bottom-up evaluation of logic programs
نویسندگان
چکیده
منابع مشابه
A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs
In this paper we start the design of a functional-logic deductive database language. Given that most logic deductive languages consider bottom-up evaluation as operational mechanism, here we will focus on the development of an operational semantics based on bottomup evaluation for functional logic languages. As in the logic paradigm, the bottom-up evaluation will consist in a magic transformati...
متن کاملcient Goal Directed Bottom - upEvaluation of Logic Programs
This paper introduces a new strategy for the eecient goal directed bottom-up evaluation of logic programs. Instead of combining a standard bottom-up evaluation strategy with a Magic-set transformation, the evaluation strategy is specialized for the application to Magic-set programs which are characterized by clause bodies with a high degree of overlapping. The approach is similar to other techn...
متن کاملEfficient Bottom-Up Execution of Logic Programs Using Abstract Interpretation
B o t t o m u p evaluation of logic programs has recently at tracted much attention in the logic programming and the deductive database field. It is complete [7], and if the number of all possible facts is finite, it is guaranteed to terminate, while t op -down evaluation may not. B o t t o m u p evaluation, however, may be inefficient since it may generate many facts irrelevant to the query. T...
متن کاملRule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs
Logic programs can be evaluated bottom-up by repeatedly applying all rules, in “iterations”, until the fixpoint is reached. However, it is often desirable — and in some cases, e.g. programs with stratified negation, even necessary to guarantee the semantics — to apply the rules in some order. An important property of a fixpoint evaluation algorithm is that it does not repeat inferences; we say ...
متن کاملWell-Founded Ordered Search: Goal-Directed Bottom-Up Evaluation of Well-Founded Models
There have been several evaluation mechanisms proposed for computing query answers based on the well-founded semantics, for programs with negation. However, these techniques are costly; in particular, for the special case of modularly stratiied programs, Ordered Search is more eecient than the general purpose techniques. However, Ordered Search is applicable only to modularly stratiied programs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1999
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(98)10024-9